منابع مشابه
Context-dependent hierarchies in pigeons.
Hierarchical organization is widespread in the societies of humans and other animals, both in social structure and in decision-making contexts. In the case of collective motion, the majority of case studies report that dominant individuals lead group movements, in agreement with the common conflation of the terms "dominance" and "leadership." From a theoretical perspective, if social relationsh...
متن کاملLandmark Hierarchies in Context
We are interested in the generation of distinguishing place or route descriptions for urban environments. Such descriptions require a hierarchical model of the discourse, the elements of the city. We postulate that cognitive hierarchies, as used in human communication, can be sufficiently reflected in machine-generated hierarchies. In this paper we (a) propose a computational model for the gene...
متن کاملPerceptual Context in Cognitive Hierarchies
Cognition does not only depend on bottom-up sensor feature abstraction, but also relies on contextual information being passed top-down. Context is higher level information that helps to predict belief states at lower levels. The main contribution of this paper is to provide a formalisation of perceptual context and its integration into a new process model for cognitive hierarchies. Several sim...
متن کاملTime-Dependent Contraction Hierarchies
Contraction hierarchies are a simple hierarchical routing technique that has proved extremely efficient for static road networks. We explain how to generalize them to networks with time-dependent edge weights. This is the first hierarchical speedup technique for timedependent routing that allows bidirectional query algorithms. For large realistic networks with considerable time-dependence (Germ...
متن کاملParallel Time-Dependent Contraction Hierarchies
Time-Dependent Contraction Hierarchies is a routing technique that solves the shortest path problem in graphs with time-dependent edge weights, that have to satisfy the FIFO property. Although it shows great speedups over Dijkstra’s Algorithm the preprocessing is slow. We present a parallelized version of the preprocessing taking advantage of the multiple cores present in todays CPUs. Nodes ind...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 2013
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.1305552110